Two basic queueing problems in communications
نویسندگان
چکیده
Finite queues with overflow are most natural in communications (in both circuit and packet switch networks). For such queues, there is no simple analytic expression for the loss probability. It is shown however that the principle of call packing leads to • an upper bound (for the loss probability) • an analytic error bound for its accuracy and • a quite reasonable approximation (superior to Erlang bounds)
منابع مشابه
Queueing Models for Computer Communications System Analysis
Modeling and performance prediction are becoming increasingly important issues in the design and operation of computer communications systems. Complexities in their configuration and sophistications in resource sharing found in today’s computer communications demand our intensive ffort to enhance the modeling capability. The present paper is intended to review the state of affairs of analytic m...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملOn service guarantees of fair-queueing schedulers in real systems
In most systems, fair-queueing packet schedulers are the algorithms of choice for providing bandwidth and delay guarantees. These guarantees are computed assuming that the scheduler is directly attached to the transmit unit with no interposed buffering, and, for timestamp-based schedulers, that the exact number of bits transmitted is known when timestamps need to be updated. Unfortunately, both...
متن کاملEmergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملPerformance analysis of queueing strategies for multiple priority calls in multiservice personal communications services
Supporting multiple priority calls, we propose the queueing strategies which efficiently manage the queue to reduce the blocking probability with multiclass calls in multiservice personal communications services (MPCS). The two queueing schemes are proposed and are shown the analytic model with n 1 1 class calls. Numerical results demonstrate that the two proposed schemes show the improved pe...
متن کامل